Stability of the optimal schedule for perishable product processing

In linear programming tasks, the optimal solution can remain same even with a significant deviation of initial data. Thus, when studying various problems in economic and mathematical analysis, question stability often arises. The problem finding schedule for processing perishable products is solved below. For example, we could refer to sugar beet, an important strategic product that degrades during storage, losing sucrose over time according some law, depending on (or) variety. Other things being equal, increase incoming sucrose, yield final - sugar, also increases, therefore, by maximizing it possible significantly production profitability. practice, equipment breaks down, raw materials stops while, but not its degradation. this regard, after resumption may change, or same. Definitions are given. It proved schedules main special cases absolutely stable. Examples conditional local period given, as well numerical experiment showing averaged absolute relative losses parameters batches periods stoppage.